Personalized Web Search Ranking CS 229 : Project Report
نویسنده
چکیده
In this project, we investigate new approaches to personalize web search result pages for users using anonymized search logs with scant data per user. We investigate modelling users into groups and personalize the user’s SERP based on the response of the users’ ‘peers’ towards the documents in the SERP. For evaluation, we compare our personalization strategy against the popular ranking strategy of sorting of documents in the SERP based on overall number of clicks. We quickly realize that personalizing every SERP makes our algorithm perform worse. When then try to learn when to personalize a SERP using a SVM on our chosen features. Although we do not achieve high tranining/test accuracy in learning when to personalize, the accuracy we achieve is sufficient to beat the click sorted ranking scheme.
منابع مشابه
An Effective Personalized Search Engine Architecture for Re-ranking Search Results Using User Behavior
Web search engines provide users with a Large number of results for a submitted query. However, not all return results are relevant to the uses needs. In this paper, we proposed a new web search personalization approach that captures the user's interest and references in the form of concepts by mining search results and they click through. In this paper an effective mixture personalized reranki...
متن کاملInnovative Personalized Architecture in Case of Web Search Users
Web search engines provide users with a Large number of results for a submitted query. However, not all return results are relevant to the uses needs. In this paper, we proposed a new web search personalization approach that captures the user's interest and references in the form of concepts by mining search results and they click through. In this paper an effective mixture personalized re-rank...
متن کاملCriteria for Cluster-Based Personalized Search
We study personalized web ranking algorithms based on the existence of document clusterings. Motivated by the topic sensitive page ranking of Haveliwala [20], we develop and implement an efficient “local-cluster” algorithm by extending the web search algorithm of Achlioptas, Fiat, Karlin and McSherry [10]. We propose some formal criteria for evaluating such personalized ranking algorithms and p...
متن کاملCluster Based Personalized Search WAW 2009
We study personalized web ranking algorithms based on the existence of document clusterings. Motivated by the topic sensitive page ranking of Haveliwala [20], we develop and implement an efficient “local-cluster” algorithm by extending the web search algorithm of Achlioptas et al. [10]. We propose some formal criteria for evaluating such personalized ranking algorithms and provide some prelimin...
متن کاملPersonalized Search
As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank...
متن کامل